Classes of Submodular Constraints Expressible by Graph Cuts ∗ Stanislav
نویسندگان
چکیده
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the theory of combinatorial optimisation, that instances of VCSPs with submodular constraints can be minimised in polynomial time. However, the general algorithm is of order O(n) and hence rather impractical. In this paper, by using results from the theory of pseudo-Boolean optimisation, we identify several broad classes of submodular constraints over a Boolean domain which are expressible using binary submodular constraints, and hence can be minimised in cubic time. Furthermore, we describe how our results translate to certain optimisation problems arising in computer vision.
منابع مشابه
Computing Science WHICH SUBMODULAR FUNCTIONS ARE EXPRESSIBLE USING BINARY SUBMODULAR FUNCTIONS?
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been devised to minimise such functions. The time complexity of the fastest known general algorithm for submodular function minimisation (SFM) is O(n6 + n5L), where n is the number of variables and L is the time required to evaluate the function. However, many important special...
متن کاملNear Optimal algorithms for constrained submodular programs with discounted cooperative costs
In this paper, we investigate two problems, namely (a) minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., and (b) optimizing a submodular function under submodular cover and submodular knapsack constraints. While both problems have hardness factors of Ω( √ n) for general submodular cost functions, we show how we can achieve constan...
متن کاملThe complexity and expressive power of valued constraints
This thesis is a detailed examination of the expressive power of valued constraints and related complexity questions. The valued constraint satisfaction problem (VCSP) is a generalisation of the constraint satisfaction problem which allows a variety of combinatorial optimisation problems to be described. Although most results are stated in this framework, they can be interpreted equivalently in...
متن کاملSubmodular Constraints and Planar Constraint Networks: New Results
In this paper, we present fast polynomial-time algorithms for solving classes of submodular constraints over Boolean domains. We pose the identified classes of problems within the general framework of Weighted Constraint Satisfaction Problems (WCSPs), reformulated as minimum weighted vertex cover problems. We examine the Constraint Composite Graphs (CCGs) associated with these WCSPs and provide...
متن کاملSymmetric Submodular Clustering with Actionable Constraint
Clustering with submodular functions has been of interest over the last few years. Symmetric submodular functions are of particular interest as minimizing them is significantly more efficient and they include many commonly used functions in practice viz. graph cuts, mutual information. In this paper we propose a novel constraint to make clustering actionable which is motivated by applications a...
متن کامل